Chinese Remainder Codes: Using Lattices to Decode Error Correcting Codes Based on Chinese Remaindering Theorem
نویسنده
چکیده
This report is an incomplete survey of Chinese Remaindering Codes. We study the work of Goldreich, Ron and Sudan [GRS00] and Boneh [B02] which give unique and list-decoding algorithms for an error correcting code based on the Chinese Remaindering Theorem. More specifically, we will look at a decoding algorithm from [GSM00] which uniquely decodes upto (n − k) log p1 log p1+log pn errors. We will also look at a list-decoding algorithm ([GRS00]) which decodes upto n− √ 2kn log pn log p1
منابع مشابه
On syndrome decoding of Chinese remainder codes
A unique decoder for the Chinese remainder codes was stated in [1] in 2000. In this paper, we present a decoder which gives the same error correction radius by introducing syndromes of the Chinese remainder codes. The error positions can be found using a so–called error–locator integer Λ which appears in the proposed key equation. To find Λ, this key equation can be solved by the extended Eucli...
متن کاملOn Polynomial Remainder Codes
Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work. We explicitly allow the code symbols to be polynomials of different degrees, which leads to two different notions of weight and distance. Algebraic decoding ...
متن کاملConstructions of Codes from Number Fields
We define number-theoretic error-correcting codes based on algebraic number fields, thereby providing a generalization of Chinese Remainder Codes akin to the generalization of ReedSolomon codes to Algebraic-geometric codes. Our construction is very similar to (and in fact less general than) the one given by Lenstra [9], but the parallel with the function field case is more apparent, since we on...
متن کاملAn approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملTight lower bound of consecutive lengths for QC-LDPC codes with girth twelve
For an arbitrary (3,L) QC-LDPC code with a girth of twelve, a tight lower bound of the consecutive lengths is proposed. For an arbitrary length above the bound the resultant code necessarily has a girth of twelve, and for the length meeting the bound, the corresponding code inevitably has a girth smaller than twelve. The conclusion can play an important role in the proofs of the existence of la...
متن کامل